Improving short-term conflict alert via tabu search
نویسنده
چکیده
In this paper we describe some work carried out by National Air Traffic Services in the UK into developing optimisation tools to help improve the effectiveness of one of their air traffic control safety systems—short-term conflict alert. In shortterm conflict alert a computer system continually monitors radar data and alerts air traffic controllers if it detects a situation where two aircraft are in danger of approaching too close to one other. Within the computer program that makes up the short-term conflict alert system is a large number of parameters. Choosing appropriate values for these parameters is a task that is currently done via extensive human intervention. In this paper we describe how a modern heuristic technique, tabu search, can be used to make parameter choices. Journal of the Operational Research Society (2002) 53, 593–602. doi:10.1057=palgrave.jors.2601358
منابع مشابه
Improving Exam Timetabling Solution Using TABU Search
A feasible exam timetable is generated using a method based on constraint satisfaction and heuristics. We investigate the usage of tabu search to further improve the quality of the exam timetable. Different length of short term tabu list and the long term tabu list is examined. Short term tabu list without long term tabu list and vice versa is also tested. Different search iteration based on ma...
متن کاملTabu Search Heuristics for the Vehicle Routing Problem
This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.
متن کاملTabu search-based metaheuristic algorithm for software system reliability problems
This paper presents a newmetaheuristic-based algorithm for complex reliability problems. The algorithm effectively uses features of the Tabu Search paradigm, with special emphasis on the exploitation of memory-based mechanisms. It balances intensification with diversification via the use of short-term and long-term memory. The algorithm has been thoroughly tested on benchmark problems from the ...
متن کاملA New Simulated Annealing-based Tabu Search Algorithm for Unit Commitment
In this paper we propose a new hybrid algorithm for solving the Unit Commitment Problem (UCP). The algorithm integrates the use of Simulated Annealing (SA) and Tabu Search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accepted. It uses a polynomial-time cooling schedule that is advocated in the SA literat...
متن کاملImplementing and testing the tabu cycle and conditional probability methods
The purpose of this paper is to describe the implementation and testing of the tabu cycle method and two variants of the conditional probability method. These methods were originally described in Glover and Laguna (1997) but have been largely ignored in the tabu search literature. For the purpose of testing, we employ a singleattribute implementation of a short-term memory procedure for the sol...
متن کامل